Some results on list T-colourings
نویسنده
چکیده
In this paper we will give some results on list T-colorings. In particular we will give a lower bound for the T-choice number of even cycles with the set T = {0, 1,2 ..... r}, r ~> 1, and give the value of the T-choice number for the even cycles C4, and C2n where n>~r.
منابع مشابه
Balanced list edge-colourings of bipartite graphs
Galvin solved the Dinitz conjecture by proving that bipartite graphs are ∆edge-choosable. We improve Galvin’s method and deduce from any colouring of the edges of bipartite graph G some further list edge-colouring properties of G. In particular, for bipartite graphs, it follows from the existence of balanced bipartite edge-colourings that balanced list edge-colourings exist as well. While the k...
متن کاملAn Upper Bound for List T-colourings
Erdos, Rubin and Taylor showed in 1979 that for any connected graph G which is not a complete graph or an odd cycle, ch(G) < A, where A is the maximum degree of a vertex in G and ch(G) is the choice number of the graph (also proved by Vizing in 1976). They also gave a characterisation of Z)-choosability. A graph G is Z)-choosable if, when we assign to each vertex u o f G a list containing d(v) ...
متن کاملSurvey of colourings and preservatives in drugs.
OBJECTIVE To assess the prevalence of colourings and preservatives in drug formulations in the United Kingdom. DESIGN Postal survey. PARTICIPANTS All pharmaceutical manufacturers in the United Kingdom were requested to supply data on drug formulations with particular regard to the content of colourings and preservatives. MAIN OUTCOME MEASURE Prevalence in proprietary drugs of colourings o...
متن کاملChannel Assignment and Improper Choosability of Graphs
We model a problem proposed by Alcatel, a satellite building company, using improper colourings of graphs. The relation between improper colourings and maximum average degree is underlined, which contributes to generalise and improve previous known results about improper colourings of planar graphs.
متن کاملBounds For Partial List Colourings
Let G be a simple graph on n vertices with list chromatic number χl = s. If each vertex of G is assigned a list of t colours Albertson, Grossman and Haas [1] asked how many of the vertices, λ t,s, are necessarily colourable from these lists? They conjectured that λt,s ≥ tn/s. Their work was extended by Chappell [2]. We improve the known lower bounds for λt,s. Primary AMS subject classification:...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 174 شماره
صفحات -
تاریخ انتشار 1997